Hybrid fractal zerotree wavelet image coding

نویسندگان

  • Taekon Kim
  • Robert E. Van Dyck
  • David J. Miller
چکیده

n Orientatio l S a subband at the l th decomposition level and at one of three orientations D-R distortion-rate T 0 initial threshold c(i,j) the wavelet coefficient at location (i,j) x a function which chooses the largest integer less than x l D the domain tree whose coarsest coefficients are in the decomposition level l 1 − l R the range tree whose coarsest coefficients are in the decomposition level l-1 x the ordered set of coefficients of a range tree y the ordered set of coefficients of a subsampled domain tree isometry T the contractive transformation S subsampling O the orientation operation α the scaling factor a R the encoding bit rate b R a rate slightly less than the encoding rate f R the fractal coding rate n R the new rate) , (j i w k the coefficient of the coordinate (i,j) in the k th subband) , (ˆ j i w k the corresponding decoded coefficient k t the weighting value for the k th subband Abstract In this paper, a hybrid fractal zerotree wavelet (FZW) image coding algorithm is proposed. The algorithm couples a zerotree-based encoder, such as the embedded zerotree wavelet (EZW) coder or set partitioning in hierarchical trees, and a fractal image coder; this coupling is done in the wavelet domain. Based on perceptually-weighted distortion-rate calculations, a fractal method is adaptively applied to the parts of an image that can be encoded more efficiently relative to an EZW coder at a given rate. In addition to improving compression performance, the proposed algorithm also allows one to impose desirable properties from each type of image coder, such as progressive transmission, the zerotree structure, and range-domain block decoding. 4

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zerotree Wavelet Coding Using Fractal Prediction

Fractal image coding can be seen as spectral prediction of coefficients in the wavelet decomposition of an image. Fine scale coefficients are described by shifted and scaled coefficients from the next coarser frequency scale. We analyzed the ability of fractal coders to predict wavelet coefficients and found that the prediction of entire wavelet subtrees-as done by conventional spatial domain f...

متن کامل

Combining wavelet and fractal coding for 3-D video coding

Smooth regions and edges are very self similar and can be coded efficiently by fractal coders. One problem of fractal image coding is to achieve a high quality or a lossless representation of an image. This can be overcome by a hybrid coding approach as proposed by the authors in [3]. An extension to 3-D fractal video coding is described in [4]. Due to the block based algorithm, however, blocki...

متن کامل

A Comparative Study: Block Truncation Coding, Wavelet, Embedded Zerotree and Fractal Image Compression on Color Image

We undertake a study of the performance difference of different transform coding techniques i.e. block truncation coding (BTC), wavelet, embedded zerotree transform and fractal image compression. This paper focuses important features of transform coding in compression of still images, including the extent to which the quality of image is degraded by the process of compression and decompression....

متن کامل

Image Compression with Iterated Function Systems, Finite Automate and Zerotrees: Grand Unification

Fractal image compression, Culik’s image compression and zerotree prediction coding of wavelet image decomposition coefficients succeed only because typical images being compressed possess a significant degree of self-similarity. This is a unifying, common concept of these seemingly dissimilar compression techniques, which may not be apparent due to particular terminologies each of the methods ...

متن کامل

Combined forward error control and packetized zerotree wavelet encoding for transmission of images over varying channels

One method of transmitting wavelet based zerotree encoded images over noisy channels is to add channel coding without altering the source coder. A second method is to reorder the embedded zerotree bitstream into packets containing a small set of wavelet coefficient trees. We consider a hybrid mixture of these two approaches and demonstrate situations in which the hybrid image coder can outperfo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Sig. Proc.: Image Comm.

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2002